Scale-free networks embedded in fractal space
نویسندگان
چکیده
The impact of an inhomogeneous arrangement of nodes in space on a network organization cannot be neglected in most real-world scale-free networks. Here we propose a model for a geographical network with nodes embedded in a fractal space in which we can tune the network heterogeneity by varying the strength of the spatial embedding. When the nodes in such networks have power-law distributed intrinsic weights, the networks are scale-free with the degree distribution exponent decreasing with increasing fractal dimension if the spatial embedding is strong enough, while the weakly embedded networks are still scale-free but the degree exponent is equal to γ = 2 regardless of the fractal dimension. We show that this phenomenon is related to the transition from a noncompact to compact phase of the network and that this transition accompanies a drastic change of the network efficiency. We test our analytically derived predictions on the real-world example of networks describing the soil porous architecture.
منابع مشابه
A box-covering algorithm for fractal scaling in scale-free networks.
A random sequential box-covering algorithm recently introduced to measure the fractal dimension in scale-free (SF) networks is investigated. The algorithm contains Monte Carlo sequential steps of choosing the position of the center of each box; thereby, vertices in preassigned boxes can divide subsequent boxes into more than one piece, but divided boxes are counted once. We find that such box-s...
متن کاملComparison Density and Fractal Dimension of Drainage Networks in Different Scales and Precision Different (Case Study: Ilam Watersheds)
Every phenomena in the nature, despite the complexity of the subject, has certain rules and regulations. River pattern and behavior as one of the most complex natural phenomena to this is not an exception. Depending on geomorphologic, climatic, topographic and erosive conditions, the waterways exhibit different patterns and behaviors. One of the parameters which can be achieved using the comple...
متن کاملFractality and self-similarity in scale-free networks
Fractal scaling and self-similar connectivity behaviour of scale-free (SF) networks are reviewed and investigated in diverse aspects. We first recall an algorithm of box-covering that is useful and easy to implement in SF networks, the so-called random sequential box-covering. Next, to understand the origin of the fractal scaling, fractal networks are viewed as comprising of a skeleton and shor...
متن کاملStructural and functional properties of spatially embedded scale-free networks.
Scale-free networks have been studied mostly as non-spatially embedded systems. However, in many realistic cases, they are spatially embedded and these constraints should be considered. Here, we study the structural and functional properties of a model of scale-free (SF) spatially embedded networks. In our model, both the degree and the length of links follow power law distributions as found in...
متن کاملGeographical Embedding of Scale-Free Networks
A method for embedding graphs in Euclidean space is suggested. The method connects nodes to their geographically closest neighbors and economizes on the total physical length of links. The topological and geometrical properties of scalefree networks embedded by the suggested algorithm are studied both analytically and through simulations. Our findings indicate dramatic changes in the embedded n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Physical review. E, Statistical, nonlinear, and soft matter physics
دوره 83 6 Pt 2 شماره
صفحات -
تاریخ انتشار 2011